On linear monotone iteration and Schwarz methods for nonlinear elliptic PDEs
نویسنده
چکیده
The Schwarz Alternating Method can be used to solve elliptic boundary value problems on domains which consist of two or more overlapping subdomains. The solution is approximated by an innnite sequence of functions which results from solving a sequence of elliptic boundary value problems in each of the subdomains. In this paper, proofs of convergence of some Schwarz Alternating Methods for nonlinear elliptic problems which are known to have solutions by the monotone method (also known as the method of subsolutions and supersolutions) are given. In particular, an additive Schwarz method for scalar as well some coupled nonlinear PDEs are shown to converge to some solution on nitely many subdomains, even when multiple solutions are possible. In the coupled system case, each subdomain PDE is linear, decoupled and can be solved concurrently with other subdomain PDEs. These results are applicable to several models in population biology.
منابع مشابه
On Schwarz Methods for Monotone Elliptic PDEs
The Schwarz Alternating Method was devised by H. A. Schwarz more than one hundred years ago to solve linear boundary value problems. It has garnered interest recently because of its potential as an efficient algorithm for parallel computers. See [Lio88], and [Lio89], the recent reviews [CM94], [LT94], and [XZ98], and the books [SBG96] and [QV99]. The literature for nonlinear problems is rather ...
متن کاملContemporary Mathematics Volume Domain Decomposition Methods for Monotone Nonlinear Elliptic Problems
In this paper we study several overlapping domain decompo sition based iterative algorithms for the numerical solution of some non linear strongly elliptic equations discretized by the nite element methods In particular we consider additive Schwarz algorithms used together with the classical inexact Newton methods We show that the algorithms con verge and the convergence rates are independent o...
متن کاملOptimized Overlapping Domain Decomposition: Convergence Proofs
During the last two decades many domain decomposition algorithms have been constructed and lot of techniques have been developed to prove the convergence of the algorithms at the continuous level. Among the techniques used to prove the convergence of classical Schwarz algorithms, the first technique is the maximum principle used by Schwarz. Adopting this technique M. Gander and H. Zhao proved a...
متن کاملNew variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملUN CO RR EC TE D PR O O F 1 Overlapping Domain Decomposition : Convergence 2 Proofs 3
During the last two decades many domain decomposition algorithms have been con8 structed and lot of techniques have been developed to prove the convergence of the 9 algorithms at the continuous level. Among the techniques used to prove the conver10 gence of classical Schwarz algorithms, the first technique is the maximum principle 11 used by Schwarz. Adopting this technique M. Gander and H. Zha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerische Mathematik
دوره 93 شماره
صفحات -
تاریخ انتشار 2002